Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains
نویسندگان
چکیده
منابع مشابه
Tree Structured Qbd Markov Chains and Tree-like Qbd Processes
In this paper we show that an arbitrary tree structured QBD Markov chain can be embedded in a tree-like QBD process with a special structure. Moreover, we present an algebraic proof that applying the natural fixed point iteration (FPI) to the nonlinear matrix equation V = B + ∑d s=1 Us(I − V )Ds that solves the tree-like QBD process, is equivalent to the more complicated iterative algorithm pre...
متن کاملTwo-Time-Scale Markov Chains and Applications to Quasi-Birth-Death Queues
Aiming at reduction of complexity, this work is concerned with two-time-scale Markov chains and applications to quasi-birth-death queues. Asymptotic expansions of probability vectors are constructed and justified. Lumping all states of the Markov chain in each subspace into a single state, an aggregated process is shown to converge to a continuous-time Markov chain whose generator is an average...
متن کاملExplorer Quasi - Birth - Death Processes , Tree - Like QBDs , Probabilistic 1 - Counter Automata , and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and both Tree-Like QBDs (TLQBDs) and Tree-Structured QBDs (TS-QBDs) are equivalent to both probabilistic Pushdown Systems (pPDSs) and Recursive Markov Chains (RMCs). We then proceed to exploit these connections to obtain a ...
متن کاملOn the Generality of Binary Tree-like Markov Chains
In this paper we show that an arbitrary tree-like Markov chain can be embedded in a binary tree-like Markov chain with a special structure. When combined with [7], this implies that any tree structured QBD Markov chain can be reduced to a binary tree-like process. Furthermore, a simple relationship between the V , Rs and Gs matrices of the original and the binary tree-like Markov chain is estab...
متن کاملQuasi - Birth - Death Processes
1 Description of the Model This case study is analog to the one described in [2]. We considered a system consisting of a fixed number of m processors and an infinite queue for storing job requests. The processing speed of a processor is described by the rate γ, while λ describes the incoming rate of new jobs. If a new job arrives while at least one processor is idle, the job will be processed d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2011
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1100.0387